11![Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ander University of Bonn, Germany (visiting NII Tokyo) February 26th, 2010 Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ander University of Bonn, Germany (visiting NII Tokyo) February 26th, 2010](https://www.pdfsearch.io/img/afd31ec1d08dde1db5210b9c637d1e07.jpg) | Add to Reading ListSource URL: www.janis-voigtlaender.euLanguage: English - Date: 2016-08-01 05:50:10
|
---|
12![Engineering Parallel String Sorting Engineering Parallel String Sorting](https://www.pdfsearch.io/img/1bf8297693ba20aaf603dbaf48106da0.jpg) | Add to Reading ListSource URL: panthema.netLanguage: English - Date: 2014-03-12 10:51:35
|
---|
13![Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ ander Technische Universit¨ at Dresden Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ ander Technische Universit¨ at Dresden](https://www.pdfsearch.io/img/be1e33458b05a9ea826b3e3ec6d676a7.jpg) | Add to Reading ListSource URL: www.janis-voigtlaender.euLanguage: English - Date: 2016-08-01 05:50:10
|
---|
14![Dept Number Semester Hours CS 220 Course Title Dept Number Semester Hours CS 220 Course Title](https://www.pdfsearch.io/img/002b68cd69ac9c048f218e4a61aa26f6.jpg) | Add to Reading ListSource URL: www.cs.siu.eduLanguage: English - Date: 2014-01-17 18:49:57
|
---|
15![Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy](https://www.pdfsearch.io/img/eb233b04f1737c07c8f5904819f8420d.jpg) | Add to Reading ListSource URL: www14.in.tum.deLanguage: English - Date: 2013-11-25 11:07:42
|
---|
16![CS264: Beyond Worst-Case Analysis Lecture #2: Instance-Optimal Geometric Algorithms∗ Tim Roughgarden† September 24, CS264: Beyond Worst-Case Analysis Lecture #2: Instance-Optimal Geometric Algorithms∗ Tim Roughgarden† September 24,](https://www.pdfsearch.io/img/3b30e871fe73e266bfef6c71bd345b96.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-10-03 12:51:27
|
---|
17![Analysis with parallel partition 11 We know a pack is O(n) work, O(log n) span ¡ Based Analysis with parallel partition 11 We know a pack is O(n) work, O(log n) span ¡ Based](https://www.pdfsearch.io/img/5b2f17fde17df204ae38b60533d2a05f.jpg) | Add to Reading ListSource URL: twiki.di.uniroma1.itLanguage: English - Date: 2015-10-28 09:23:18
|
---|
18![Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009 Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009](https://www.pdfsearch.io/img/65a75f351f1f95d0a898d8168b85d85e.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2009-10-14 08:51:26
|
---|
19![Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3 Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3](https://www.pdfsearch.io/img/570aea938d1eff1c11c65d6cfeae52ef.jpg) | Add to Reading ListSource URL: courses.csail.mit.eduLanguage: English - Date: 2011-03-01 11:09:57
|
---|
20![CS2101 Due: Monday 3-rd of November 2014 Problem Set 2 CS2101 CS2101 Due: Monday 3-rd of November 2014 Problem Set 2 CS2101](https://www.pdfsearch.io/img/51670cedbb7b3caa52a9b8c8f4a58ba7.jpg) | Add to Reading ListSource URL: www.csd.uwo.caLanguage: English - Date: 2014-10-16 01:53:26
|
---|